第 K 次选择问题

从最优停止理论的经典问题──秘书问题出发,构想了Ｋ个经理从Ｎ个姑娘中各选一秘书的问题,证明了其最优规则,得出了概率最优值是参数为Ｋ的泊松分布的第Ｋ项,即ｅ￣（－ｋ）ｋ￣ｋ／ｋ从！,从侧面印证了第一标准秘书问题。     

正则化方法在拉普拉斯数值反演中的应用

本文用正则化方法给出了拉普拉斯变换的数值反演方法,并考虑了问题的不适定性,此方法在实际中有较强的应用价值.     

新型角速率火控系统研究

根据激光测距仪获得的目标斜距,建立实时确定目标速度和过航斜距的数学模型,并提出解决角速率火控系统中普遍存在的计算延迟、预测精度不高和弹道气象修正困难等问题的方案。     

用正则化方法对频谱有限信号进行外推的新算法

本文给出了频谱有限信号外推的一个新算法,首先考虑了问题的不适定性,然后用正则化方法构造一个稳定算法,因本文把噪音η(t)看成是L~2〔-T,T〕(T > 0)中的函数,且当integral from n=-T to T (|η(t)|~2dt→0时,外推在(-∞, ∞)上一致逼近准确信号,所以有较强的应用价值.最后还给出了外推的误差估计.     

Exact algorithms and bounds for the dynamic assignment interdiction problem

We study a multi‐stage dynamic assignment interdiction (DAI) game in which two agents, a user and an attacker, compete in the underlying bipartite assignment graph. The user wishes to assign a set of tasks at the minimum cost, and the attacker seeks to interdict a subset of arcs to maximize the user's objective. The user assigns exactly one task per stage, and the assignment costs and interdiction impacts vary across stages. Before any stage commences in the game, the attacker can interdict arcs subject to a cardinality constraint. An interdicted arc can still be used by the user, but at an increased assignment cost. The goal is to find an optimal sequence of assignments, coupled with the attacker's optimal interdiction strategy. We prove that this problem is strongly NP‐hard, even when the attacker can interdict only one arc. We propose an exact exponential‐state dynamic‐programming algorithm for this problem as well as lower and upper bounds on the optimal objective function value. Our bounds are based on classical interdiction and robust optimization models, and on variations of the DAI game. We examine the efficiency of our algorithms and the quality of our bounds on a set of randomly generated instances. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 373–387, 2017     

三维半线性波动方程初值问题解的破裂

研究了半线性波动方程初值问题在三维空间中解的生命跨度的上界估计,关于此初值问题的爆破解将被建立。无论多么小的初值,该问题都没有整体解,在前人研究的基础上给出该初值问题解的生命跨度的上界估计。     

中国机器人产业持续发展的制约因素及措施

中国机器人企业由于研发力量薄弱,缺乏核心技术,高端人才匮乏,产品成本高昂,加之没有政策引领,没能形成规模化应用,所占市场份额不足10%。文章探讨如何破解中国机器人产业现存问题并寻求针对性解决措施。     

高炮群火力优化分配的指派模型

火力优化分配是高炮群指挥控制的关键环节。依据有严格理论证明和实用价值的指派问题及其解法(匈牙利法),构建了一对一射击和多对一射击情形下的高炮群火力优化分配的指派模型,探讨了该模型的求解,分析了该模型的实际应用,并通过具体实例对该模型进行了初步验证。该模型的解法被证明是多项式时间算法,满足作战实时性要求。实际应用表明该模型用于解决高炮群的火力分配问题是有效的。     

Discrete equal‐capacity p‐median problem

This paper examines the discrete equal‐capacity p‐median problem that seeks to locate p new facilities (medians) on a network, each having a given uniform capacity, in order to minimize the sum of distribution costs while satisfying the demand on the network. Such problems arise, for example, in local access and transport area telecommunication network design problems where any number of a set of p facility units can be constructed at the specified candidate sites (hence, the net capacity is an integer multiple of a given unit capacity). We develop various valid inequalities, a separation routine for generating cutting planes that are specific members of such inequalities, as well as an enhanced reformulation that constructs a partial convex hull representation that subsumes an entire class of valid inequalities via its linear programming relaxation. We also propose suitable heuristic schemes for this problem, based on sequentially rounding the continuous relaxation solutions obtained for the various equivalent formulations of the problem. Extensive computational results are provided to demonstrate the effectiveness of the proposed valid inequalities, enhanced formulations, and heuristic schemes. The results indicate that the proposed schemes for tightening the underlying relaxations play a significant role in enhancing the performance of both exact and heuristic solution methods for this class of problems. © 2000 John & Sons, Inc. Naval Research Logistics 47: 166–183, 2000.     

打击特殊群体贩毒活动现状及对策研究

近年来，随着我国堵截、打击毒品犯罪力度的持续加大，境内外贩毒集团组织实施大宗毒品贩运的能力明显减弱，毒品犯罪快速蔓延的势头得到初步遏制。但是，贩毒集团为逃避打击、降低风险，不断变换犯罪手法，钻法律漏洞，特别是组织、利用特殊人群进行贩毒活动的现象日益增多，并呈现出家族化、规模化的趋势，而公安机关在打击特殊群体贩毒活动中，由于立法和执法等多方面的原因，还面临法律、查缉、羁押、案件处理等一系列的问题。执法实践要求运用法律、经济、行政、教育、文化等措施，综合治理特殊群体贩毒问题，努力从源头上遏制特殊人群贩毒问题的滋生、蔓延。